Geometric Algebra in Linear Algebra and Geometry

This article explores the use of geometric algebra in linear and multilinear algebra, and in affine, projective and conformal geometries. Our principal objective is to show how the rich algebraic tools of geometric algebra are fully compatible with and augment the more traditional tools of matrix algebra. The novel concept of an h-twistor makes possible a simple new proof of the striking relationship between conformal transformations in a pseudo-Euclidean space to isometries in a pseudo-Euclidean space of two higher dimensions. The utility of the h-twistor concept, which is a generalization of the idea of a Penrose twistor to a pseudo-Euclidean space of arbitrary signature, is amply demonstrated in a new treatment of the Schwarzian derivative.     

von Neumann代数中套子代数上的Lie同构

本文给出因子von Neumann代数中的幂等算子在广义Lie积下的一个刻画; 得到因子von Neumann代数中套子代数的幂等算子在Lie积下的一个特征．作为应用, 研究了因子von Neumann代数中套子代数上的Lie同构,并证明因子von Neumann 代数中套子代数之间的Lie同构,要么是同构与广义迹之和,要么是负反同构与广义迹之和．     

无限维奇Hamilton模李超代数的导子

本文首先确定了无限维奇Hamilton模李超代数的生成元集,然后确定了奇Hamilton模李超代数到广义Witt模李超代数的导子空间,进而确定了无限维奇Hamilton模李超代数的导子代数.     

Quadratic transformations of the sixth Painlevé equation with application to algebraic solutions

In 1991, one of the authors showed the existence of quadratic transformations between the Painlevé VI equations with local monodromy differences (1/2, a, b, ±1/2) and (a, a, b, b). In the present paper we give concise forms of these transformations. They are related to the quadratic transformations obtained by Manin and Ramani–Grammaticos–Tamizhmani via Okamoto transformations. To avoid cumbersome expressions with differentiation, we use contiguous relations instead of the Okamoto transformations. The 1991 transformation is particularly important as it can be realized as a quadratic‐pull back transformation of isomonodromic Fuchsian equations. The new formulas are illustrated by derivation of explicit expressions for several complicated algebraic Painlevé VI functions. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

TUHF代数上的Lie导子

证明了TUHF代数丁上的Lie导子L形如D l．其中D是T上的结合导子，l是从T到它的中心Z上的线性映射且零化T中的括积．     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

三级近似束流光学计算程序

为了精确计算束流在离子光学系统中的传输,用Visual FORTRAN 6.5语言编写了一个计算程序,长约13000行. 此程序可以计算由三圆筒单透镜、三膜片单透镜、双元筒透镜、均匀场静电加速管、磁四极透镜、六极磁铁、静电四极透镜、偏转磁铁、螺线管透镜、ExB~正交电磁场分析器、静电偏转器、漂浮管、QWR(Quarter Wave Resonators)和SLR(Split Loop Resonators)射频加速元件等元件任意组成的离子光学系统. 粒子轨迹的计算可精确到三级近似. 粒子的分布类型也可以有多种选择. 程序具有最优化计算功能,即可以自动调整元件的参数,以实现所需要的光学条件. 各元件之后的横向和纵向相图以及系统的束流包络线以图形方式显示在屏幕上.     

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable mixed-integer quadratic problem to permit using perspective cuts to improve its continuous relaxation bound. The new method favorably compares with a previously proposed one requiring a minimum eigenvalue computation.     

Corner view on the crown domain

In this paper we raise a question about the boundary of the crown domain of a Riemannian symmetric space X. In case X is of Hermitian type we give an affirmative answer.     

Equality and inequality constrained optimization algorithms with convergent stepsizes

In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker.